Continuous Population-Based Incremental Learning with Mixture Probability Modeling for Dynamic Optimization Problems
نویسندگان
چکیده
This paper proposes a multimodal extension of PBILC based on Gaussian mixture models for solving dynamic optimization problems. By tracking multiple optima, the algorithm is able to follow the changes in objective functions more efficiently than in the unimodal case. The approach was validated on a set of synthetic benchmarks including Moving Peaks, dynamization of the Rosenbrock function and compositions of functions from the IEEE CEC’2009 competition. The result obtained in the experiments proved the efficiency of the approach in solving dynamic problems with a number of competing peaks.
منابع مشابه
Dual Population-Based Incremental Learning for Problem Optimization in Dynamic Environments
In recent years there is a growing interest in the research of evolutionary algorithms for dynamic optimization problems since real world problems are usually dynamic, which presents serious challenges to traditional evolutionary algorithms. In this paper, we investigate the application of Population-Based Incremental Learning (PBIL) algorithms, a class of evolutionary algorithms, for problem o...
متن کاملExperimental study on population-based incremental learning algorithms for dynamic optimization problems
Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world problems are often dynamic. This seriously challenges traditional evolutionary algorithms. In this paper, the application of PopulationBased Incremental Learning (PBIL) algorithms, a class of evolutionary algorithms, for dynamic problems is investigated. Inspired by the co...
متن کاملDirect Memory Schemes for Population-Based Incremental Learning in Cyclically Changing Environments
The population-based incremental learning (PBIL) algorithm is a combination of evolutionary optimization and competitive learning. The integration of PBIL with associative memory schemes has been successfully applied to solve dynamic optimization problems (DOPs). The best sample together with its probability vector are stored and reused to generate the samples when an environmental change occur...
متن کاملPopulation-Based Continuous Optimization, Probabilistic Modelling and Mean Shift
Evolutionary algorithms perform optimization using a population of sample solution points. An interesting development has been to view population-based optimization as the process of evolving an explicit, probabilistic model of the search space. This paper investigates a formal basis for continuous, population-based optimization in terms of a stochastic gradient descent on the Kullback-Leibler ...
متن کاملReal-valued Evolutionary Optimization using a Flexible Probability Density Estimator
Population-Based Incremental Learning (PBIL) is an abstraction of a genetic algorithm , which solves optimization problems by explicitly constructing a probabilistic model of the promising regions of the search space. At each iteration the model is used to generate a population of candidate solutions and is itself modiied in response to these solutions. Through the extension of PBIL to Real-val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014